9 found
Order:
  1.  4
    [Omnibus Review].Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.
  2.  77
    Eliminating the continuum hypothesis.Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (2):219-225.
    In this paper we show how the assumption of the generalized continuum hypothesis (GCH) can be removed or partially removed from proofs in Zermelo-Frankel set theory (ZF) of statements expressible in the simple theory of types. We assume the reader is familiar with the latter language, especially with the classification of formulas and sentences of that language into Σκη and Πκη form (cf. [1]) and with how that language can be relatively interpreted into the language of ZF.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  3.  27
    G. Kreisel and Gerald E. Sacks. Metarecursive sets. The journal of symbolic logic, vol. 30 , pp. 318–338.Richard A. Platek - 1968 - Journal of Symbolic Logic 33 (4):622-623.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  4. Kreisel, Generalized Recursion Theory, Stanford and Me.Richard A. Platek - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana: About and Around Georg Kreisel. A K Peters. pp. 97.
     
    Export citation  
     
    Bookmark  
  5.  9
    The Converse to a Metatheorem in Gödel Set Theory.Richard A. Platek - 1971 - Mathematical Logic Quarterly 17 (1):21-22.
  6.  24
    The Converse to a Metatheorem in Gödel Set Theory.Richard A. Platek - 1971 - Mathematical Logic Quarterly 17 (1):21-22.
  7.  41
    Gerald E. Sacks. Metarecursively enumerable sets and admissible ordinals. Bulletin of the American Mathematical Society, vol. 72 , pp. 59–64. - Gerald E. Sacks. Post's problem, admissible ordinals, and regularity. Transactions of the American Mathematical Society, vol. 124 , pp. 1–23. - Gerald E. Sacks. Metarecursion theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 243–263. - Graham C. DriscollJr., Metarecursively enumerable sets and their metadegrees. The Journal of symbolic logic, vol. 33 , pp. 389–11. [REVIEW]Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  32
    R. O. Gandy. Computable functionals of finite type I. Sets, models and recursion theory. Proceedings of the Summer School In Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 202–242. [REVIEW]Richard A. Platek - 1970 - Journal of Symbolic Logic 35 (1):157-158.
  9.  14
    Review: R. O. Gandy, John N. Crossley, Computable Functionals of Finite Type I. [REVIEW]Richard A. Platek - 1970 - Journal of Symbolic Logic 35 (1):157-158.